Consensus Decision Modeling with Distributionally Robust Chance Constraint in Uncertain Environments
نویسندگان
چکیده
Group decision-making (GDM) in an ambiguous environment has consistently become a research focus the decision science field during past decade. Existing minimum cost consensus models either control total budget deterministic context or on improving utility of makers. In this study, novel model with distributionally robust chance constraint (DRO-MCCM) is explored. First, two constraints are developed based varied preferences decision-makers and taking into consideration uncertainty unit adjustment cost. Next, construct conditional value-at-risk (CVaR) to approximate constraint, simulate viewpoint makers such as function Gaussian distribution, convert feasible semidefinite programming problem using dual theory moment method. Finally, supply chain management scenario involving new product prices employs these models. Comparison sensitivity analyses demonstrates model’s superiority effectiveness.
منابع مشابه
Stability Analysis for Mathematical Programs with Distributionally Robust Chance Constraint
Stability analysis for optimization problems with chance constraints concerns impact of variation of probability measure in the chance constraints on the optimal value and optimal solutions and research on the topic has been well documented in the literature of stochastic programming. In this paper, we extend such analysis to optimization problems with distributionally robust chance constraints...
متن کاملConvergence Analysis for Mathematical Programs with Distributionally Robust Chance Constraint
Convergence analysis for optimization problems with chance constraints concerns impact of variation of probability measure in the chance constraints on the optimal value and the optimal solutions and research on this topic has been well documented in the literature of stochastic programming. In this paper, we extend such analysis to optimization problems with distributionally robust chance cons...
متن کاملDistributionally robust chance-constrained linear programs
In this paper, we discuss linear programs in which the data that specify the constraints are subject to random uncertainty. A usual approach in this setting is to enforce the constraints up to a given level of probability. We show that for a wide class of probability distributions (i.e. radial distributions) on the data, the probability constraints can be explicitly converted into convex second...
متن کاملOn Distributionally Robust Chance-Constrained Linear Programs1
In this paper, we discuss linear programs in which the data that specify the constraints are subject to random uncertainty. A usual approach in this setting is to enforce the constraints up to a given level of probability. We show that, for a wide class of probability distributions (namely, radial distributions) on the data, the probability constraints can be converted explicitly into convex se...
متن کاملDistributionally Robust Chance-Constrained Bin Packing
Chance-constrained bin packing problem allocates a set of items into bins and, for each bin, bounds the probability that the total weight of packed items exceeds the bin’s capacity. Different from the stochastic programming approaches relying on full distributional information of the random item weights, we assume that only the information of the mean and covariance matrix is available. Accordi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematics
سال: 2023
ISSN: ['2314-4785', '2314-4629']
DOI: https://doi.org/10.1155/2023/8269182